Near Optimal Control With Reachability and Safety Guarantees
نویسندگان
چکیده
منابع مشابه
Modified Group Generalized Binary Search with Near-Optimal Performance Guarantees
Group Generalized Binary Search (Group GBS) is an extension of the well known greedy algorithm GBS, for identifying the group of an unknown object while minimizing the number of binary questions posed about that object. This problem referred to as group identification or the Equivalence Class determination problem arises in applications such as disease diagnosis, toxic chemical identification, ...
متن کاملOn reachability and minimum cost optimal control
Questions of reachability for continuous and hybrid systems can be formulated as optimal control or game theory problems, whose solution can be characterized using variants of the Hamilton-Jacobi-Bellman or Isaacs partial differential equations. The formal link between the solution to the partial differential equation and the reachability problem is usually established in the framework of visco...
متن کاملAdaptive Cruise Control with Safety Guarantees for Autonomous Vehicles
This paper addresses the problem of following a vehicle with varying acceleration in a comfortable and safe manner. Our architecture consists of a nominal controller (here: model predictive control) and a safety controller. Although model predictive control attempts to keep a safe distance, it cannot formally guarantee it, due to the assumptions on the behavior of the leading vehicle. We addres...
متن کاملCompressed Sensing with Sparse Binary Matrices: Instance Optimal Error Guarantees in Near-Optimal Time
A compressed sensing method consists of a rectangular measurement matrix, M ∈ R m×N with m ≪ N , together with an associated recovery algorithm, A : R → R . Compressed sensing methods aim to construct a high quality approximation to any given input vector x ∈ R using onlyMx ∈ R as input. In particular, we focus herein on instance optimal nonlinear approximation error bounds for M and A of the f...
متن کاملOptimal Histograms with Quality Guarantees
Histograms are commonly used to capture attribute value distribution statistics for query optimizers. More recently, histograms have also been considered as a way to produce quick approximate answers to decision support queries. This widespread interest in histograms motivates the problem of computing his-tograms that are good under a given error metric. In particular, we are interested in an e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2019
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2019.09.146